Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals

نویسندگان

  • Alain Trouvé
  • Laurent Younes
چکیده

This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties which should be satisfied by the optimal matching. A new, exact, dynamic programming algorithm is then designed for the minimization. We conclude with experimental results on shape comparison.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Class of Diffeomorphic Matching Problems in One Dimension

We study a class of functional which can be used for matching objects which can be represented as mappings from a fixed interval, I, to some “feature space.” This class of functionals corresponds to “elastic matching” in which a symmetry condition and a “focus invariance” are imposed. We provide sufficient conditions under which an optimal matching can be found between two such mappings, the op...

متن کامل

Diffeomorphic metric surface mapping in subregion of the superior temporal gyrus.

This paper describes the application of large deformation diffeomorphic metric mapping to cortical surfaces based on the shape and geometric properties of subregions of the superior temporal gyrus in the human brain. The anatomical surfaces of the cortex are represented as triangulated meshes. The diffeomorphic matching algorithm is implemented by defining a norm between the triangulated meshes...

متن کامل

Robust Diffeomorphic Mapping via Geodesically Controlled Active Shapes

This paper presents recent advances in the use of diffeomorphic active shapes which incorporate the conservation laws of large deformation diffeomorphic metric mapping. The equations of evolution satisfying the conservation law are geodesics under the diffeomorphism metric and therefore termed geodesically controlled diffeomorphic active shapes (GDAS). Our principal application in this paper is...

متن کامل

On the computational complexity of finding a minimal basis for the guess and determine attack

Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...

متن کامل

A Novel Assisted History Matching Workflow and its Application in a Full Field Reservoir Simulation Model

The significant increase in using reservoir simulation models poses significant challenges in the design and calibration of models. Moreover, conventional model calibration, history matching, is usually performed using a trial and error process of adjusting model parameters until a satisfactory match is obtained. In addition, history matching is an inverse problem, and hence it may have non-uni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000